Chaotic Path Planning for 3D Area Coverage Using a Pseudo-Random Bit Generator from a 1D Chaotic Map

This work proposes a one-dimensional chaotic map with simple structure and three parameters. The phase portraits, bifurcation diagrams, Lyapunov exponent diagrams are first plotted to study the dynamical behavior of map. It is seen that exhibits areas constant chaos respect all then applied problem pseudo-random bit generation using technique generate four bits per iteration. shown algorithm passes statistical NIST ENT tests, as well shows low correlation an acceptable key space. generated bitstream path planning, for autonomous robot or generally unmanned aerial vehicle (UAV) exploring given 3D area. aim ensure efficient area coverage, while also maintaining unpredictable motion. Numerical simulations were performed evaluate performance planning strategy, it coverage percentage converges exponentially 100% number iterations increases. discrete motion adapted smooth one through use B-Spline curves.